heuristic approach

См. также в других словарях:

• heuristic approach — heuristinis metodas statusas T sritis automatika atitikmenys: angl. heuristic approach; heuristic method vok. heuristische Methode, f rus. эвристический метод, m pranc. méthode heuristique, f …   Automatikos terminų žodynas

• heuristic method — heuristinis metodas statusas T sritis automatika atitikmenys: angl. heuristic approach; heuristic method vok. heuristische Methode, f rus. эвристический метод, m pranc. méthode heuristique, f …   Automatikos terminų žodynas

• Heuristic — Heu*ris tic (h[ u]*r[i^]s t[i^]k), n. 1. A heuristic method; a specific heuristic procedure. [PJC] 2. A theory or approach which serves to promote discovery or learning by encouraging experimentation. [PJC] …   The Collaborative International Dictionary of English

• heuristic — heuristically, adv. /hyoo ris tik/ or, often, /yoo /, adj. 1. serving to indicate or point out; stimulating interest as a means of furthering investigation. 2. encouraging a person to learn, discover, understand, or solve problems on his or her… …   Universalium

• heuristic — n. heuristic method, investigative approach to problem solving adj. serving to discover, investigative …   English contemporary dictionary

• Hyper-heuristic — A hyper heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics (or components of such… …   Wikipedia

• Similarity heuristic — The similarity heuristic is a lesser known psychological heuristic pertaining to how people make judgments based on similarity. More specifically, the similarity heuristic is used to account for how people make judgments based on the similarity… …   Wikipedia

• Null-move heuristic — In computer chess programs, the null move heuristic is a heuristic technique used to enhance the speed of the alpha beta pruning algorithm. Contents 1 Rationale 2 Implementation 3 Problems with the null move heuristic …   Wikipedia

• Admissible heuristic — In computer science, specifically in algorithms related to Pathfinding, a heuristic function is said to be admissible if it is no more than the lowest cost path to the goal. In other words, a heuristic is admissible if it never overestimates the… …   Wikipedia

• Consistent heuristic — In computer science, a consistent (or monotone) heuristic function is a strategy for search that approaches the solution in an incremental way without taking any step back. Formally, for every node N and every successor P of N generated by any… …   Wikipedia

• World-systems approach — World system approach is a post Marxist view of world affairs, one of several historical and current applications of Marxism to international relations. One of the basics of the approach is its view of imperialism, which for many Marxists during… …   Wikipedia